By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 12, Issue 1, pp. 1-214

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Computational Complexity of Continued Fractions

V. Strassen

pp. 1-27

BibTeX  Abstract Full Text:  PDF

Optimal Search in Planar Subdivisions

David Kirkpatrick

pp. 28-35

BibTeX  Abstract Full Text:  PDF

Tools for Template Dependencies

Ronald Fagin, David Maier, Jeffrey D. Ullman, and Mihalis Yannakakis

pp. 36-59

BibTeX  Abstract Full Text:  PDF

Bounds for Multifit Scheduling on Uniform Processors

D. K. Friesen and M. A. Langston

pp. 60-70

BibTeX  Abstract Full Text:  PDF

Minimum $s$-$t$ Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time

John H. Reif

pp. 71-81

BibTeX  Abstract Full Text:  PDF

A Technique for Establishing Completeness Results in Theorem Proving with Equality

Gerald E. Peterson

pp. 82-100

BibTeX  Abstract Full Text:  PDF

Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties

Hans F. de Groote

pp. 101-117

BibTeX  Abstract Full Text:  PDF

Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching

Kenneth J. Supowit and Edward M. Reingold

pp. 118-143

BibTeX  Abstract Full Text:  PDF

The Travelling Salesman Problem and Minimum Matching in the Unit Square

Kenneth J. Supowit, Edward M. Reingold, and David A. Plaisted

pp. 144-156

BibTeX  Abstract Full Text:  PDF

Simple Constructions for Multiterminal Network Flow Synthesis

Dan Gusfield

pp. 157-165

BibTeX  Abstract Full Text:  PDF

Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms

A. C. Fleck and R. S. Limaye

pp. 166-188

BibTeX  Abstract Full Text:  PDF

On Proving Uniform Termination and Restricted Termination of Rewriting Systems

J. V. Guttag, D. Kapur, and D. R. Musser

pp. 189-214

BibTeX  Abstract Full Text:  PDF